Multiplicative character sums and non linear geometric codes
نویسنده
چکیده
Abstract . Let q he a power of a prime number, Fq the finite field with q elements, n an integer dividing q 1, n > 2, and g a character of order n of the multiplicative group Fq. I f X is an algebraic curve defined over Fq and if G is a divisor on X, we define a non linear code F(q, X, G, n, X) on an alphabet with n + 1 letters.We compute the parameters of this code, through the consideration of some character sums.
منابع مشابه
Binary Spherical Geometric Codes
Let q be a power of an odd prime number and Fq be the finite field with q elements. We will construct a binary spherical code from an algebraic curve C defined over Fq and a rational divisor G on C, as the twist by the quadratic character 11 of the Goppa code L(G). The computation of the parameters of this code is based on the study of some character sums. 0. Introduction. In a previous paper (...
متن کاملCharacter sums and MacWilliams identities
We show that certain character sums are intimately connected with MacWilliams identities for linear poset codes as well as usual linear codes. We also illustrate in some two poset codes that this method gives much shorter proofs than the ones using discrete Poisson summation formula. © 2004 Elsevier B.V. All rights reserved. MSC: primary 11L03; 94B60; secondary 94B05
متن کاملCharacter sums with Beatty sequences on Burgess-type intervals
We estimate multiplicative character sums taken on the values of a non-homogeneous Beatty sequence {⌊αn + β⌋ : n = 1, 2, . . . }, where α, β ∈ R, and α is irrational. Our bounds are nontrivial over the same short intervals for which the classical character sum estimates of Burgess have been established. 2000 Mathematics Subject Classification: 11B50, 11L40, 11T24
متن کاملMultiplicative Character Sums with the Sum of g-ary Digits Function
We establish upper bounds for multiplicative character sums with the function σg(n) which computes the sum of the digits of n in a fixed base g ≥ 2. Our results may be viewed as analogues of some previously known results for exponential sums with sum of g-ary digits function. MSC Numbers: 11L40, 11A63.
متن کاملMultiplicative Character Sums with Counter-Dependent Nonlinear Congruential Pseudorandom Number Generators
Nonlinear congruential pseudorandom number generators can have unexpectedly short periods. Shamir and Tsaban introduced the class of counter-dependent generators which admit much longer periods. In this paper we present a bound for multiplicative character sums for nonlinear sequences generated by counter-dependent generators.
متن کامل